Gaussian subtraction (GS) algorithms for word spotting in continuous speech
نویسندگان
چکیده
In this paper, a novel approach for the design of cohort models for word spotting in continuous speech is presented. This new approach is based on modifying the probability density function of a conventional filler so that regions in the feature space that are related to the keyword will be reduced or removed. By modifying these regions, the filler and keyword models become more orthogonal in the sense that they represent different areas in the feature space, making the filler appropriate to be used as a cohort model. The algorithms, named Gaussian Subtraction (GS) and Gaussian Removal (GR), may be considered discriminative training algorithms.
منابع مشابه
Speaker, Vocabulary and Context Independent Word Spotting System for Continuous Speech
Word spotting is a widely known subject in continuous speech recognition and the traditional approaches use either hidden Markov models (HMM) or Gaussian mixture models (GMM). In this paper, we propose a different approach based on language independent phoneme modeling. The proposed system is speaker and vocabulary independent, and it is easy to implement. An equal error rate (EER) of 3.34% and...
متن کاملSpoken Term Detection for Persian News of Islamic Republic of Iran Broadcasting
Islamic Republic of Iran Broadcasting (IRIB) as one of the biggest broadcasting organizations, produces thousands of hours of media content daily. Accordingly, the IRIBchr('39')s archive is one of the richest archives in Iran containing a huge amount of multimedia data. Monitoring this massive volume of data, and brows and retrieval of this archive is one of the key issues for this broadcasting...
متن کاملAn investigation of the use of dynamic time warping for word spotting and connected speech recognition
Several variations on algorithms for dynamic time warping have been proposed for speech processing applications. In this paper two general algorithms that have been proposed for word spotting and connected word recognition are studied. These algorithms are called the fixed range method and the local minimum method. The characteristics and properties of these algorithms are discussed. It is show...
متن کاملA Word-spotting Hypothesis Testing for Accepting/Rejecting Continuous Speech Recognition Output
The word rejection problem in speech recognition is formulated in a framework of word-spotting, where a spotted word is verified through a binary, acceptance/rejection decision. A generalized word posterior probability (GWPP), used as the sole confidence measure, is computed in a word graph, via the forward-backward algorithm or in an N-best list, using string likelihoods. The GWPP is further e...
متن کاملComparison of keyword spotting approaches for informal continuous speech
This paper describes several approaches to keyword spotting (KWS) for informal continuous speech. We compare acoustic keyword spotting, spotting in word lattices generated by large vocabulary continuous speech recognition and a hybrid approach making use of phoneme lattices generated by a phoneme recognizer. The systems are compared on carefully defined test data extracted from ICSI meeting dat...
متن کامل